Recursive penalized least squares solution for dynamical inverse problems of EEG generation
نویسندگان
چکیده
منابع مشابه
Recursive penalized least squares solution for dynamical inverse problems of EEG generation.
In the dynamical inverse problem of electroencephalogram (EEG) generation where a specific dynamics for the electrical current distribution is assumed, we can impose general spatiotemporal constraints onto the solution by casting the problem into a state space representation and assuming a specific class of parametric models for the dynamics. The Akaike Bayesian Information Criterion (ABIC), wh...
متن کاملOn the Least Squares Solution of Inverse Eigenvalue Problems
An inverse eigenvalue problem where a matrix is to be constructed from some or all of its eigenvalues may not have a real valued solution at all An approximate solution in the sense of least squares is sometimes desirable Two types of least squares problems are formulated and explored in this paper In spite of their di erent appearance the two problems are shown to be equivalent Thus one new nu...
متن کاملRecursive least squares with stabilized inverse factorization
Recently developed recursive least squares schemes, where the square root of both the covariance and the information matrix are stored and updated, are known to be particularly suited for parallel implementation. However, when finite precision arithmetic is used, round-off errors apparently accumulate unboundedly, so that after a number of updates the computed least squares solutions turn out t...
متن کاملPenalized Least Squares and Penalized Likelihood
where pλ(·) is the penalty function. Best subset selection corresponds to pλ(t) = (λ/2)I(t 6= 0). If we take pλ(t) = λ|t|, then (1.2) becomes the Lasso problem (1.1). Setting pλ(t) = at + (1 − a)|t| with 0 ≤ a ≤ 1 results in the method of elastic net. With pλ(t) = |t| for some 0 < q ≤ 2, it is called bridge regression, which includes the ridge regression as a special case when q = 2. Some penal...
متن کاملA recursive total least squares algorithm for deconvolution problems
Deconvolution problems are encountered in signal processing applications where an unknown input signal can only be observed after propagation through one or more noise corrupted FIR channels. The first step in recovering the input usually entails an estimation of the FIR channels through training based or blind algorithms. The ’standard’ procedure then uses least squares estimation to recover t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Human Brain Mapping
سال: 2004
ISSN: 1065-9471,1097-0193
DOI: 10.1002/hbm.20000